Interaction Strength Analysis to Model Retweet Cascade Graphs
نویسندگان
چکیده
منابع مشابه
Continuum Cascade Model of Directed Random Graphs: Traveling Wave Analysis
We study a class of directed random graphs. In these graphs, the interval [0, x] is the vertex set, and from each y ∈ [0, x], directed links are drawn to points in the interval (y, x] which are chosen uniformly with density one. We analyze the length of the longest directed path starting from the origin. In the x → ∞ limit, we employ traveling wave techniques to extract the asymptotic behavior ...
متن کاملExploration Study of Retweet Propensity
Twitter, a social media platform, can be used to spread information across social networks. A critical aspect of this spread of information is user’s engagment within such environments, specifically the level that a user will ’retweet’. This paper describes three experiments on observational data collected on Twitter. First, this paper will explore the possible causal structure that can be foun...
متن کاملLarge deviations of cascade processes on graphs.
Simple models of irreversible dynamical processes such as bootstrap percolation have been successfully applied to describe cascade processes in a large variety of different contexts. However, the problem of analyzing nontypical trajectories, which can be crucial for the understanding of out-of-equilibrium phenomena, is still considered to be intractable in most cases. Here we introduce an effic...
متن کاملTotal vertex irregularity strength of corona product of some graphs
A vertex irregular total k-labeling of a graph G with vertex set V and edge set E is an assignment of positive integer labels {1, 2, ..., k} to both vertices and edges so that the weights calculated at vertices are distinct. The total vertex irregularity strength of G, denoted by tvs(G)is the minimum value of the largest label k over all such irregular assignment. In this paper, we study the to...
متن کاملIrregularity strength of dense graphs
Let G be a simple graph of order n with no isolated vertices and no isolated edges. For a positive integer w, an assignment f on G is a function f : E(G) → {1, 2, . . . , w}. For a vertex v, f(v) is defined as the sum f(e) over all edges e of G incident with v. f is called irregular, if all f(v) are distinct. The smallest w for which there exists an irregular assignment on G is called the irreg...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Sciences
سال: 2020
ISSN: 2076-3417
DOI: 10.3390/app10238394